Pushing Semantics Inside Recursion: A General Framework for Semantic Optimization of Recursive Queries
نویسندگان
چکیده
We consider a class of linear query programs and integrity constraints and develop methods for (i) computing the residues and (ii) pushing them inside the re-cursive programs, minimizing redundant computation and run-time overhead. We also discuss applications of our strategy to intelligent query answering.
منابع مشابه
Incoherence and Subsumption for Recursive Views and Queries in Object-Oriented Data Models
Object-oriented data models are being extended with recursion to gain expressive power. This complicates both the incoherence detection problem which has to deal with recursive classes descriptions and the optimization problem which has to deal with recur-sive queries on complex objects. In this paper, we propose a theoretical framework able to face the above problems. In particular, it is able...
متن کاملDeveloping a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information
With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...
متن کاملDeclarative Networking with Distributed Recursive Query Processing
There have been recent proposals in the networking and distributed systems literature on declarative networks, where networks are declaratively specified using a recursive query language. This represents a significant new application area for database recursive query processing technologies. In this paper, we extend upon these recent work in the following ways. First, we define and motivate the...
متن کاملChase of Recursive Queries
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we can state our main contribution as an algorithm that builds a program P ′ equivalent to a given program P , when both are applied over a database d satisfying a set of functional dependencies. The input program P is a ...
متن کاملOptimization of Logic Queries ? with MIN
We propose an algorithm for pushing min and max aggregates into recursive predicates, while preserving query equivalence under certain monotonicity constraints. The transformed query is often safe when the original one is not, and more eecient than the original query when this is safe.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995